Cut Elimination with ξ-Functionality
نویسندگان
چکیده
منابع مشابه
Conjunction without Conditions in Illative Combinatory Logic
In [3] the prepositional connectives were defined in terms of the combinators K and S and the illative obs Ξ and H (ΞXY can be interpreted as “Y V holds for all V such that XV holds” and HX can be interpreted as “X is a proposition”). Given an elimination rate for Ξ and introduction rules for H and Ξ, all the standard intuitionistic propositional calculus results could be proved provided the va...
متن کاملA Most General Edge Elimination Polynomial - Thickening of Edges
We consider a graph polynomial ξ(G;x, y, z) introduced by Ilia Averbouch, Benny Godlin, and Johann A. Makowsky (2008). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Klaus Dohmen, André Pönitz, and Peter Tittmann (2003). We derive an identity which relates the graph polynomial ξ of a thickened graph (i.e. a graph with...
متن کاملRestricted Edge Connectivity of Regular Graphs
An edge cut that separates the connected graph into components with order at least two is restricted edge cut. The cardinality of minimum restricted edge cut is restricted edge connectivity. Denote byλ′ ( G) the restricted edge connectivity , then λ′( G) ≤ξ( G) where ξ( G) is the minimum edge degree. G is called maximal restricted edge connected if the equality in the previous inequality holds....
متن کاملModular Cut-Elimination: Finding Proofs or Counterexamples
Modular cut-elimination is a particular notion of ”cut-elimination in the presence of non-logical axioms” that is preserved under the addition of suitable rules. We introduce syntactic necessary and sufficient conditions for modular cut-elimination for standard calculi, a wide class of (possibly) multipleconclusion sequent calculi with generalized quantifiers. We provide a ”universal” modular c...
متن کاملRefined Complexity Analysis of Cut Elimination
In [1, 2] Zhang shows how the complexity of cut elimination depends primarily on the nesting of quantifiers in cut formulas. By studying the role of contractions in cut elimination we can refine that analysis and show how the complexity depends on a combination of contractions and quantifier nesting. With the refined analysis the upper bound on cut elimination coincides with Statman’s lower bou...
متن کامل